An MML-based tool for evaluating the complexity of (stochastic) logic theories

نویسنده

  • Héctor Castillo-Andreu
چکیده

Theory evaluation is a key problem in many areas: machine learning, scientific discovery, inverse engineering, decision making, software engineering, design, human sciences, etc. If we have a set of theories that are able to explain the same set of phenomena, we need a criterion to choose which one is best. There are, of course, many possible criteria. Model simplicity is one of the most common criteria in theory evaluation. The Minimum Message Length (MML) is a solid approach to evaluate theories relative to a given evidence or data. Theories can be expressed in specific or general (Turing-complete) languages. First-order logic, and logic programming in particular, is a Turingcomplete language. Evaluating the simplicity of a theory or program described in a Turing-complete language is much more difficult than just counting the number of lines or bits. It is, in fact, the problem of calculating its Kolmogorov complexity, which is uncomputable. Few works in the literature have been able to present accurate and effective approximations for a Turing-complete language. In this work, we present the first general MML coding scheme for logic programs. With this scheme, we can quantify the bits of information required to code (or send) a theory, a set of data or the same data given the theory. Moreover, we extend the expressiveness of the language to stochastic logic programs, which are not only able to model the truth value of any set of phenomena, but also their probability. As a result, we extend the coding scheme to stochastic logic programs. This opens up the applicability of model selection to many different problems which have a stochastic or probabilistic character, such as games, social phenomena, language processing, Markov processes, etc. As a realization of the above-mentioned schemes, we present a software tool which is able to code and evaluate a set of alternative (stochastic) theories (programs) against a set of examples. We illustrate the application of the tool to a variety of non-probabilistic and probabilistic scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EVALUATING EFFICIENCY OF BIG-BANG BIG-CRUNCH ALGORITHM IN BENCHMARK ENGINEERING OPTIMIZATION PROBLEMS

Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...

متن کامل

How Do We Evaluate Health in All Policies?; Comment on “Developing a Framework for a Program Theory-Based Approach to Evaluating Policy Processes and Outcomes: Health in All Policies in South Australia”

It is well-established that population health is influenced by a multitude of factors, many of which lie outside the scope of the health sector. In the public health literature it is often assumed that intersectoral engagement with nonhealth sectors will be instrumental in addressing these social determinants of health. Due to the expected desirable outcomes in population health, several countr...

متن کامل

A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers

This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...

متن کامل

Applying MML to ILP ∗

In Inductive Logic Programming (ILP), since logic is a complete (universal) language, innitely many possible hypotheses are compatible (hence plausible) given the evidence. An intrinsic way of selecting the most convenient hypothesis from the set of possible theories is not only useful for model selection but it is also useful for guiding the search in the hypotheses space, as some ILP systems ...

متن کامل

Prediction and evaluation of runoff data in south of Qazvin watershed, using a fuzzy logic technique

The important criteria for designing in the most of hydrologic and hydraulic construction projects are based on runoff or peak-flow of water. Mostly, this measure and criterion is calculated or estimated by stochastic data. Another feature of these data that are used in watershed hydrological studies is their impreciseness. Therefore, in this study, in order to deal with uncertainty and impreci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1210.5974  شماره 

صفحات  -

تاریخ انتشار 2012